Uncertainty-oriented Workshop Layout and Scheduling Integration Optimization
نویسندگان
چکیده
منابع مشابه
Joint Scheduling and Layout Optimization to Enable Multi-Level Vectorization
We describe a novel loop nest scheduling strategy implemented in the R-Stream compiler : the first scheduling formulation to jointly optimize a trade-off between parallelism, locality, contiguity of array accesses and data layout permutations in a single complete formulation. Our search space contains the maximal amount of vectorization in the program and automatically finds opportunities for a...
متن کاملGrid Scheduling Optimization Under Conditions of Uncertainty
One of the biggest challenges in building grid schedulers is how to deal with the uncertainty in what future computational resources will be available. Current techniques for Grid scheduling rarely account for resources whose performance, reliability, and cost vary with time simultaneously. In this paper we address the problem of delivering a deadline based scheduling in a dynamic and uncertain...
متن کاملScheduling optimization under uncertainty - an alternative approach
The prevalent approach to the treatment of processing time uncertainties in production scheduling problems is through the use of probabilistic models. Apart from requiring detailed information about probability distribution functions, this approach also has the drawback that the computational expense of solving these models is very high. In this work, we present a non-probabilistic treatment of...
متن کاملTask Scheduling using Constraint Optimization with Uncertainty
Multiagent task scheduling encompasses diverse domains of problems that require complex models and robust solutions. C-TÆMS [1] is a new specification, based on TÆMS [2], for multiagent task scheduling problems that represents the complex relationships necessary to model these domains. Some recent work has been done in the area of mapping the C-TÆMS scheduling problem into a Distributed Constra...
متن کاملA memory-layout oriented run-time technique for locality optimization
Exploiting locality at run-time is a complementary approach to a compiler approach for those applications with dynamic memory access patterns. This paper proposes a memory-layout oriented approach to exploit cache locality for parallel loops at run-time on Symmetric Multi-Processor (SMP) systems. Guided by applicationdependent hints and the targeted cache architecture, it reorganizes and partit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Jixie gongcheng xuebao
سال: 2023
ISSN: ['0577-6686']
DOI: https://doi.org/10.3901/jme.2023.05.235